Resonance of Basis-conjugating Automorphism Groups

نویسنده

  • DANIEL C. COHEN
چکیده

1. Resonance of PΣn Let Fn be the free group generated by x1, . . . , xn. The basis-conjugating automorphism group, or pure symmetric automorphism group, is the group PΣn of all automorphisms of Fn which send each generator xi to a conjugate of itself. Results of Dahm [4] and Goldsmith [6] imply that this group may also be realized as the “group of loops,” the group of motions of a collection of n unknotted, unlinked oriented circles in 3-space, where each circle returns to its original position. McCool [8] found the following presentation for the basis-conjugating automorphism group:

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Topological Complexity of Basis-conjugating Automorphism Groups

We compute the topological complexity of Eilenberg-MacLane spaces associated to the group of automorphisms of a finitely generated free group which act by conjugation on a given basis, and to certain subgroups.

متن کامل

On Automorphism Groups of Free Products of Finite Groups, I: Proper Actions

If G is a free product of finite groups, let ΣAut1(G) denote all (necessarily symmetric) automorphisms of G that do not permute factors in the free product. We show that a McCullough-Miller [D. McCullough and A. Miller, Symmetric Automorphisms of Free Products, Mem. Amer. Math. Soc. 122 (1996), no. 582] and Gutiérrez-Krstić [M. Gutiérrez and S. Krstić, Normal forms for the group of basis-conjug...

متن کامل

Computing Conjugating Sets and Automorphism Groups of Rational Functions

Let φ and ψ be endomorphisms of the projective line of degree at least 2, defined over a field F . From a dynamical perspective, a significant question is to determine whether φ and ψ are conjugate (or to answer the related question of whether a given rational function φ has a nontrivial automorphism). We construct efficient algorithms for computing the set of conjugating maps (resp., the group...

متن کامل

The Exceptional Symmetry

This note gives an elementary proof that the symmetric groups possess only one exceptional symmetry. I am referring to the fact that the outer automorphism group of the symmetric group Symn is trivial unless n = 6 and the outer automorphism group of Sym6 has a unique nontrivial element. When we study symmetric groups, we often invoke their natural faithful representation as permutations of a se...

متن کامل

Free-by-cyclic groups have solvable conjugacy problem

We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed subgroups of free group automorphisms, and one of P. Brinkmann that one can determine whether two cyclic words in a free group are mapped to each other by some power of a given automorphism. The algorithm ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008